Vector bin packing with multiple-choice
نویسندگان
چکیده
منابع مشابه
Vector Bin Packing with Multiple-Choice
We consider a variant of bin packing calledmultiple-choice vector bin packing. In this problem we are given a set of n items, where each item can be selected in one of several D-dimensional incarnations. We are also given T bin types, each with its own cost and D-dimensional size. Our goal is to pack the items in a set of bins of minimum overall cost. The problem is motivated by scheduling in n...
متن کاملMultiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression
The vector bin packing problem (VBP) is a generalization of bin packing with multiple constraints. In this problem we are required to pack items, represented by p-dimensional vectors, into as few bins as possible. The multiple-choice vector bin packing (MVBP) is a variant of the VBP in which bins have several types and items have several incarnations. We present an exact method, based on an arc...
متن کاملBin Packing with Multiple Colors
The Bin Packing problem is a classical optimization problem with many practical applications related to minimizing time or space. The Black and White Bin Packing problem is a variation proposed by Balogh et al. (2012), where we are given a set of items each with a weight and a color either white or black. We have an unlimited number of bins each with a weight limit and we assume that no item we...
متن کاملVPSolver 3: Multiple-choice Vector Packing Solver
VPSolver is a vector packing solver based on an arc-flow formulation with graph compression. In this paper, we present the algorithm introduced in VPSolver 3.0.0 for building compressed arc-flow models for the multiple-choice vector packing problem.
متن کاملMultiple Destination Bin Packing
There exists ample literature about on-line and off-line algorithms to solve the two and three dimensional bin packing problem. However, non of the off-line algorithms presented in literature are designed for the case that there are constraints on the order in which the objects have to be removed from the bin. This constraint is relevant in the case that we are loading a truck with several orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.02.020